RNAPrimed for Packing?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics for Packing Semifluids

Physical properties of materials are seldom studied in the context of packing problems. In this work we study the behavior of semifluids: materials with particular characteristics, that share properties both with solids and with fluids. We describe the importance of some specific semifluids in an industrial context, and propose methods for tackling the problem of packing them, taking into accou...

متن کامل

RNA: primed for packing?

How does RNA's seemingly subtle 2'-hydroxyl group contribute to its diverse biological functions? Using quantitative structure-activity relationship (QSAR) analysis, Piccirilli and colleagues find that the 2'-OH fosters van der Waals and hydrophobic interactions that play underappreciated roles in RNA structure and molecular recognition.

متن کامل

Packing for the journey

Nearly 2 m of DNA is so tightly packaged that it fits neatly within the nucleus of each cell of our body. As if this was not mind-blowing enough, the problem is intensified in the male germline, as the nucleus of a sperm cell is about 6 times smaller than that of a somatic cell. Sperm are highly specialized cells charged with the sole responsibility of delivering the paternal genome to offsprin...

متن کامل

Strip Packing vs. Bin Packing

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...

متن کامل

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemistry & Biology

سال: 2004

ISSN: 1074-5521

DOI: 10.1016/s1074-5521(04)00039-0